Pattern matching in pseudo real-time

نویسندگان

  • Raphaël Clifford
  • Benjamin Sach
چکیده

It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as being local. Informally, a distance function is said to be local if for a pattern P of lengthm and any substring T [i, i+m−1] of a text T , the distance between P and T [i, i+m− 1] can be expressed as Σj∆(P [j], T [i+ j]), where ∆ is any distance function between individual characters. We show in this work how to tackle online approximate matching when the distance function is nonlocal. We give new solutions which are applicable to a wide variety of matching problems including function and parameterised matching, swap matching, swapmismatch, k-difference, k-difference with transpositions, overlap matching, edit distance/LCS and L1 and L2 rearrangement distances. The resulting online algorithms bound the worst case running time per input character to within a log factor of their comparable offline counterpart.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor

Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...

متن کامل

Real Time Pseudo-Range Correction Predicting by a Hybrid GASVM model in order to Improve RTDGPS Accuracy

Differential base station sometimes is not capable of sending correction information for minutes, due to radio interference or loss of signals. To overcome the degradation caused by the loss of Differential Global Positioning System (DGPS) Pseudo-Range Correction (PRC), predictions of PRC is possible. In this paper, the Support Vector Machine (SVM) and Genetic Algorithms (GAs) will be incorpor...

متن کامل

Pseudo Steady State Gas Flow in Tight Reservoir under Dual Mechanism Flow

Gas reservoirs with low permeability (k<0.1 mD) are among the unconventional reservoirs and are commonly termed as "Tight Gas Reservoirs". In conventional gas reservoirs that have high permeability, the flow of gas is basically controlled by the reservoir permeability and it is calculated using the Darcy equation. In these reservoirs, gas flow due to gas diffusion is ignored compared to Dar...

متن کامل

Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

The following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Discrete Algorithms

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2011